Recognition and parsing of context-free languages in time n3

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parsing of Context Free Languages

Parsing is the process of assigning structure to sentences The structure is obtained from the grammatical description of the language Both in Com puter Science and in Computational Linguistics context free grammars and associated parsing algorithms are among the most useful tools Numerous parsing algorithms have been developed Special subclasses of the context free grammars have been introduced...

متن کامل

Fuzzy context-free languages - Part 2: Recognition and parsing algorithms

In a companion paper [9] we used fuzzy context-free grammars in order to model grammatical errors resulting in erroneous inputs for robust recognizing and parsing algorithms for fuzzy context-free languages. In particular, this approach enables us to distinguish between small errors (“tiny mistakes”) and big errors (“capital blunders”). In this paper we present some algorithms to recognize fuzz...

متن کامل

Certified CYK parsing of context-free languages

We report a work on certified parsing for context-free grammars. In our development we implement the Cocke–Younger–Kasami parsing algorithm and prove it correct using the Agda dependently typed programming language.

متن کامل

Efficient Incremental Parsing for Context-Free Languages

An incremental parsing algorithm based on dynamic programming techniques is described’. The analyzer takes the automaton generated from a general class of context-free grammars as driver, and any finite string as input. Given an input string that has been modified, the algorithm cuts out the parts of the old analysis that had been generated b y the parts of the input that has changed. What rema...

متن کامل

Eecient Incremental Parsing for Context-free Languages

An incremental parsing algorithm based on dynamic programming techniques is described 1. The analyzer takes the automaton generated from a general class of context-free grammars as driver, and any nite string as input. Given an input string that has been modiied, the algorithm cuts out the parts of the old analysis that had been generated by the parts of the input that has changed. What remains...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1967

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(67)80007-x